An Ant Approach for Structured Quadratic Assignment Problems
نویسندگان
چکیده
The paper presents a new heuristic method for the quadratic assignment problem. This method is based on an artificial ant system, hybridized with a fast local search. The method is easy to implement and numerical results show that it is fast and efficient for structured problems.
منابع مشابه
A Particle Swarm Approach to Quadratic Assignment Problems
Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. But research on the Quadratic Assignment Problem (QAP) has not much been investigated. In this paper, we introduce a novel approach based on PSO for QAPs. The representations of the position and velocity of the particles in the conventional PSO is extended from the real vector...
متن کاملAnalysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP
Ant Colony Optimization (ACO) is a bioinspired metaheuristic based on ants foraging used to solve different classes of problems. In this paper, we show how, using a Two-Stage approach the quality of the solutions of ACO is improved. The Two-Stage approach can be applied to different ACO. The performance of this new approach is studied in the Traveling Salesman Problem and Quadratic Assignment P...
متن کامل2 Nd International Conference on Metaheuristics - Mic 97 32
In this paper we present an extension of MAX{MIN Ant System applying it to Traveling Salesman Problems and Quadratic Assignment Problems. The extension involves the use of a modiied choice rule and a hybrid scheme allowing ants to improve their solution by local search. The computational results show that this algorithm can be used to eeciently nd near optimal solutions to hard combinatorial op...
متن کاملAnt Colonies for the Quadratic Assignment Problem
This paper presents HAS-QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone trail information to perform modifications on QAP solutions, unlike more traditional ant systems that use pheromone trail information to construct complete solutions. HAS-QAP is analysed and compared with some of the best heuristics available f...
متن کاملAnt Colonies for the QAP
This paper presents HAS-QAP, an hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone trail information to perform modifications on QAP solutions, differently from more traditional ant systems that use pheromone trail information to construct complete solutions. HAS-QAP is analysed and compared with some of the best heuristics ...
متن کامل